Automaton groups and complete square complexes
نویسندگان
چکیده
The first example of a non-residually finite group in the classes finitely presented small-cancelation groups, automatic and $\\operatorname{CAT}(0)$ groups was constructed by Wise as fundamental complete square complex (CSC for short) with twelve squares. At same time, Janzen proved that CSCs at most three, five or seven squares have residually group. smallest open cases were four directed $\\mathcal{VH}$ complexes six We prove CSC studied has For class complexes, we there are exactly two having In particular, this positively answers to question Wise. Our approach relies on connection between automata discovered Glasner Mozes, where one vertex correspond bireversible automata. associated automaton states over binary alphabet generating an infinite describe get simple representations free $F_2$.
منابع مشابه
Groups Acting on CAT (0) Square Complexes
We study groups acting on CAT (0) square complexes. In particular we show if Y is a nonpositively curved (in the sense of A. D. Alexandrov) finite square complex and the vertex links of Y contain no simple loop consisting of five edges, then any subgroup of π1(Y ) either is virtually free abelian or contains a free group of rank two. In addition we discuss when a group generated by two hyperbol...
متن کاملSome Solvable Automaton Groups
It is shown that certain ascending HNN extensions of free abelian groups of finite rank, as well as various lamplighter groups, can be realized as automaton groups, i.e., can be given a self-similar structure. This includes the solvable Baumslag-Solitar groups BS(1, m), for m 6= ±1. In addition, it is shown that, for any relatively prime integers m, n ≥ 2, the pair of Baumslag-Solitar groups BS...
متن کاملAutomata and Square Complexes.
We introduce a new geometric tool for analyzing groups of finite au-tomata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method we give examples of free groups and of Kazhdan groups which are generated by the different states of one finite (bi-reversible) automaton. We also reproduc...
متن کاملAmenability of linear-activity automaton groups
We prove that every linear-activity automaton group is amenable. The proof is based on showing that a sufficiently symmetric random walk on a specially constructed degree 1 automaton group — the mother group — has asymptotic entropy 0. Our result answers an open question by Nekrashevich in the Kourovka notebook, and gives a partial answer to a question of Sidki. Figure 1: A Schreier graph for a...
متن کاملOn the Complexity of the Word Problem of Automaton Semigroups and Automaton Groups
In this paper, we study the word problem of automaton semigroups and automaton groups from a complexity point of view. As an intermediate concept between automaton semigroups and automaton groups, we introduce automaton-inverse semigroups, which are generated by partial, yet invertible automata. We show that there is an automaton-inverse semigroup and, thus, an automaton semigroup with a PSpace...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Groups, Geometry, and Dynamics
سال: 2022
ISSN: ['1661-7207', '1661-7215']
DOI: https://doi.org/10.4171/ggd/649